Optimal search on a technology landscape

نویسندگان

  • Stuart Kauffman
  • José Lobo
  • William G. Macready
چکیده

We address the question of how a firm’s current location in the space of technological possibilities constrain its search for technological improvements. We formalize a quantitative notion of distance between technologies — encompassing the distinction between evolutionary changes (small distance) versus revolutionary change (large distance) — and introduce a technology landscape into an otherwise standard dynamic programming setting where the optimal strategy is to assign a reservation price to each possible technology. Technological search is modeled as movement, constrained by the cost of search, on a technology landscape. Simulations are presented on a stylized technology landscape while analytic results are derived using landscapes that are similar to Markov random fields. We find that early in the search for technological improvements, if the initial position is poor or average, it is optimal to search far away on the technology landscape; but as the firm succeeds in finding technological improvements it is optimal to confine search to a local region of the landscape. © 2000 Elsevier Science B.V. All rights reserved. JEL classification: C61; C63; L20; O3

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Landscapes: a Natural Extension of Search Theory

Technological change at the rm-level has commonly been modeled as random sampling from a xed distribution of possibilities. Such models typically ignore empirically important aspects of the rm's search process, namely the related observations that a rm's current technology constrains future innovation and that rms' technological search tends to be local in nature. In this paper we explicitly tr...

متن کامل

Tailoring Mutation to Landscape Properties

We present numerical results on Kau man's NK landscape family indicating that the optimal distance at which to search for tter variants depends on both the current tness and the sampling that can be a orded at each distance. The optimal search distance from average tness con gurations is large to escape local correlation limits and decreases as tness increases. An analytic derivation of the opt...

متن کامل

Constrained Nonlinear Optimal Control via a Hybrid BA-SD

The non-convex behavior presented by nonlinear systems limits the application of classical optimization techniques to solve optimal control problems for these kinds of systems. This paper proposes a hybrid algorithm, namely BA-SD, by combining Bee algorithm (BA) with steepest descent (SD) method for numerically solving nonlinear optimal control (NOC) problems. The proposed algorithm includes th...

متن کامل

Distributed Generation Effects on Unbalanced Distribution Network Losses Considering Cost and Security Indices

Due to the increasing interest on renewable sources in recent years, the studies on integration of distributed generation to the power grid have rapidly increased. In order to minimize line losses of power systems, it is crucially important to define the size and location of local generation to be placed. Minimizing the losses in the system would bring two types of saving, in real life, one is ...

متن کامل

Distributed Generation Effects on Unbalanced Distribution Network Losses Considering Cost and Security Indices

Due to the increasing interest on renewable sources in recent years, the studies on integration of distributed generation to the power grid have rapidly increased. In order to minimize line losses of power systems, it is crucially important to define the size and location of local generation to be placed. Minimizing the losses in the system would bring two types of saving, in real life, one is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998